An O(n³(loglogn/log n)^5/4) Time Algorithm for All Pairs Shortest PathYIJIE HAN.Algorithmica. 2008, Vol 51, Num 4, pp 428-434, issn 0178-4617, 7 p.Article

Effect of congestion costs on shortest paths through complex networksASHTON, Douglas J; JARRETT, Timothy C; JOHNSON, Neil F et al.Physical review letters. 2005, Vol 94, Num 5, pp 058701.1-058701.4, issn 0031-9007Article

Enhancing traffic capacity for scale-free networks by the one-way linksKE HU; CHAOFEI LIU; TAO HU et al.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 17, issn 1751-8113, 175101.1-175101.10Article

Une transformation du problème du sac-à-dos avec une contrainte d'égalité = Transformation of Knapsach problem with equality constraintRIBEIRO, Celso.1983, 9 p.Report

A branch-checking algorithm for all-pairs shortest pathsDUIN, Cees.Algorithmica. 2005, Vol 41, Num 2, pp 131-145, issn 0178-4617, 15 p.Article

On the quickest path problemGEN-HUEY CHEN; YUNG-CHEN HUNG.Information processing letters. 1993, Vol 46, Num 3, pp 125-128, issn 0020-0190Article

The shortest path improvement problems under Hamming distanceBINWU ZHANG; JIANZHONG ZHANG; LIQUN QI et al.Journal of combinatorial optimization. 2006, Vol 12, Num 4, pp 351-361, issn 1382-6905, 11 p.Article

Sparser: a paradigm for running distributed algorithmsAFEK, Y; RICKLIN, M.Journal of algorithms (Print). 1993, Vol 14, Num 2, pp 316-328, issn 0196-6774Article

Shortest-path reconstruction algorithmsKHOONG, C. M.Computer journal (Print). 1993, Vol 36, Num 6, pp 588-592, issn 0010-4620Article

A dual-ascent procedure for large-scale uncapacitated network designBALAKRISHNAN, A; MAGNANTI, T. L; WONG, R. T et al.Operations research. 1989, Vol 37, Num 5, pp 716-740, issn 0030-364X, 25 p.Article

Linear-space best-first searchKORF, R. E.Artificial intelligence. 1993, Vol 62, Num 1, pp 41-78, issn 0004-3702Article

Uncapacitated lot-sizing problems with start-up costsWOLSEY, L. A.Operations research. 1989, Vol 37, Num 5, pp 741-747, issn 0030-364X, 7 p.Article

Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted GraphsBASWANA, Surender; KHANNA, Neelesh.Algorithmica. 2013, Vol 66, Num 1, pp 18-50, issn 0178-4617, 33 p.Article

All-pairs nearly 2-approximate shortest paths in O(n²polylog n) timeBASWANA, Surender; GOYAL, Vishrut; SEN, Sandeep et al.Theoretical computer science. 2009, Vol 410, Num 1, pp 84-93, issn 0304-3975, 10 p.Article

Finding K shortest looping paths in a traffic-light networkYANG, Hsu-Hao; CHEN, Yen-Liang.Computers & operations research. 2005, Vol 32, Num 3, pp 571-581, issn 0305-0548, 11 p.Article

Considering displacement modes in the fleet management problemBIGRAS, Louis-Philippe; GAMACHE, Michel.International journal of production research. 2005, Vol 43, Num 6, pp 1171-1184, issn 0020-7543, 14 p.Article

Better alternatives to OSPF routingFONG, Jessica H; GILBERT, Anna C; KANNAN, Sampath et al.Algorithmica. 2005, Vol 43, Num 1-2, pp 113-131, issn 0178-4617, 19 p.Article

Performance of shortest path algorithms in network flow problemsDIVOKY, J. J; HUNG, M. S.Management science. 1990, Vol 36, Num 6, pp 661-673, issn 0025-1909, 13 p.Article

A Simpler and More Efficient Algorithm for the Next-to-Shortest Path ProblemBANG YE WU.Algorithmica. 2013, Vol 65, Num 2, pp 467-479, issn 0178-4617, 13 p.Article

Heuristic shortest path algorithms for transportation applications : State of the artFU, L; SUN, D; RILETT, L. R et al.Computers & operations research. 2006, Vol 33, Num 11, pp 3324-3343, issn 0305-0548, 20 p.Article

Optimally fast shortest path algorithms for some classes of graphsMORIYA, E; TSUGANE, K.International journal of computer mathematics. 1998, Vol 70, Num 2, pp 297-317, issn 0020-7160Article

Bicriterion shortest path problem with a general nonadditive costPENG CHEN; YU NIE.Transportation research. Part B : methodological. 2013, Vol 57, pp 419-435, issn 0191-2615, 17 p.Conference Paper

A shortest path algorithm for real-weighted undirected graphsPETTIE, Seth; RAMACHANDRAN, Vijaya.SIAM journal on computing (Print). 2005, Vol 34, Num 6, pp 1398-1431, issn 0097-5397, 34 p.Article

Path enumeration by finding the constrained K-shortest pathsVAN DER ZIJPP, N. J; CATALANO, S. Fiorenzo.Transportation research. Part B : methodological. 2005, Vol 39, Num 6, pp 545-563, issn 0191-2615, 19 p.Article

Minimizing risk models in stochastic shortest path problemsOHTSUBO, Yoshio.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 1, pp 79-88, issn 1432-2994, 10 p.Article